Generalized Longo–Rehren Subfactors and α-Induction

We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor N⊂M and α^±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M ^opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from α^plusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S ¹ to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002     

On a bifurcation governed by hysteresis nonlinearity

We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.     

CMS physics overview

The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.     

拉曼放大器中放大的自发拉曼散射与拉曼开-关增益关系的研究

研究了拉曼放大器中放大的自发拉曼散射对拉曼开－关增益的影响，并提出了一种利用自发拉曼散射谱来调整拉曼放大器位曼开－关增益平坦的方法，实验采用4个波长为14xx nm的激光二极管作为抽运源，75km的G．652光纤作为传输介质，获得了C波段附近的光放大，同时对此给出了合理的理论解释。     

来自磁光阱中冷原子团的荧光干涉条纹及其应用

实验观察来自磁光阱中冷原子团的荧光经真空系统窗口的平板玻璃反射产生的干涉条纹，理论分析表明从从荧光干涉条纹的强度分布可获得关于俘获原子总数以及密度分布的信息。采用该方法实测了俘获原子总数，并模拟得到了不同密度分布时条纹的对比度变化。     

Using multi-exposure of color fringes to measure the beating motion of a moth

A multi-exposure of color fringes method has been developed to improve the capture speed of a conventional color CCD camera. In the method, four groups of projected fringe patterns encoded with different colors and different directions are stored in one CCD frame. Therefore the capture frequency of the conventional CCD can be improved to 200 Hz. It is available to measure the insect wings with low beating frequency, such as dragonfly, moth, or butterfly, whose beating frequency is about 30–40 Hz. We have used the method to measure the beating motion of a moth successfully.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.